Spaces with congruence
نویسندگان
چکیده
منابع مشابه
Spaces with congruence
(E;L) denotes an aÆne plane, (E;L; ) an ordered plane, and denotes the congruence relation on E E. If we assume (E;L; ) as an hyperbolic plane, there exists the corresponding theorem for hyperbolic planes (cf. [3]). For both proofs we consider rst the group of motions, in particular the line re ections. For the de nition of a motion and a line re ection we need only a congruence relation (cf. [...
متن کاملOn Local Congruence of Immersions in Homogeneous or Nonhomogeneous Spaces
We show how to find a complete set of necessary and sufficient conditions that solve the fixed-parameter local congruence problem of immersions in G-spaces, whether homogeneous or not, provided that a certain k order jet bundle over the G-space admits a G-invariant local coframe field of constant structure. As a corollary, we note that the differential order of a minimal complete set of congrue...
متن کاملCongruence Closure with Integer Offsets
Congruence closure algorithms for deduction in ground equational theories are ubiquitous in many (semi-)decision procedures used for verification and automated deduction. They are also frequently used in practical contexts where some interpreted function symbols are present. In particular, for the verification of pipelined microprocessors, in many cases it suffices to be able to deal with integ...
متن کاملCongruence Closure with Free Variables
Many verification techniques nowadays successfully rely on SMT solvers as back-ends to automatically discharge proof obligations. These solvers generally rely on various instantiation techniques to handle quantifiers. We here show that the major instantiation techniques in SMT solving can be cast in a unifying framework for handling quantified formulas with equality and uninterpreted functions....
متن کاملAutomata with Finite Congruence Lattices
In this paper we prove that if the congruence lattice of an automaton A is finite then the endomorphism semigroup E(A) of A is finite. Moreover, if A is commutative then A is A-finite. We prove that if 3 ≤ |A| then a commutative automaton A is simple if and only if it is a cyclic permutation automaton of prime order. We also give some results concerning cyclic, strongly connected and strongly t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.11.034